Detecting rare and faint signals via thresholding maximum likelihood estimators

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rates of Convergence of Maximum Likelihood Estimators Via Entropy Methods

I declare that this essay is my own work done as part of the Part III Examination. It is the result of my own work, and except where stated otherwise, includes nothing which was performed in collaboration. No part of this essay has been submitted for a degree or any such qualification.

متن کامل

On the distribution of penalized maximum likelihood estimators: The LASSO, SCAD, and thresholding

We study the distributions of the LASSO, SCAD, and thresholding estimators, in finite samples and in the large-sample limit. The asymptotic distributions are derived for both the case where the estimators are tuned to perform consistent model selection and for the case where the estimators are tuned to perform conservative model selection. Our findings complement those of Knight and Fu (2000) a...

متن کامل

The Convergence of Lossy Maximum Likelihood Estimators

Given a sequence of observations (Xn)n≥1 and a family of probability distributions {Qθ}θ∈Θ, the lossy likelihood of a particular distribution Qθ given the data Xn 1 := (X1,X2, . . . ,Xn) is defined as Qθ(B(X 1 ,D)), where B(Xn 1 ,D) is the distortion-ball of radius D around the source sequence X n 1 . Here we investigate the convergence of maximizers of the lossy likelihood.

متن کامل

Asymptotic Distributions of Quasi-Maximum Likelihood Estimators

Asymptotic properties of MLEs and QMLEs of mixed regressive, spatial autoregressive models are investigated. The stochastic rates of convergence of the MLE and QMLE for such models may be less than the √ n-rate under some circumstances even though its limiting distribution is asymptotically normal. When spatially varying regressors are relevant, the MLE and QMLE of the mixed regressive, autoreg...

متن کامل

Common Voting Rules as Maximum Likelihood Estimators

Voting is a very general method of preference aggregation. A voting rule takes as input every voter’s vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the alternatives. One potential view of voting is the following. There exists a “correct” outcome (winner/ranking), and each voter’s vote corresponds to a noisy perception...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 2018

ISSN: 0090-5364

DOI: 10.1214/17-aos1574